Tuning iteration space slicing based tiled multi-core code implementing Nussinov’s RNA folding
نویسندگان
چکیده
منابع مشابه
Iteration Space Slicing and ItsApplication
Program slicing is an analysis that answers questions such as \Which statements might aaect the computation of variable v at statement s?" or \Which statements depend on the value of v computed in statement s?". The answers computed by program slicing are generally a set of statements. We introduce the idea of iteration spacing slicing: we reene program slicing to ask questions such as \Which i...
متن کاملTiled Multi-Core Stream Architecture
Conventional stream architectures focus on exploiting ILP and DLP in the applications, although stream model also exposes abundant TLP at kernel granularity. On the other side, with the development of model VLSI technology, increasing application demands and scalability challenges conventional stream architectures. In this paper we present a novel Tiled Multi-Core Stream Architecture called TiS...
متن کاملAn Efficient Code Generation Technique for Tiled Iteration Spaces
This paper presents a novel approach for the problem of generating tiled code for nested for-loops, transformed by a tiling transformation. Tiling or supernode transformation has been widely used to improve locality in multi-level memory hierarchies, as well as to efficiently execute loops onto parallel architectures. However, automatic code generation for tiled loops can be a very complex comp...
متن کاملSynchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing
This paper contributes to the theory and practice of automatic extraction of synchronization-free parallelism in nested loops. It extends the iterationspace slicing framework to extract slices described by not only affine (linear) but also non-affine forms. A slice is represented by a set of dependent loop statement instances (iterations) forming an arbitrary graph topology. The algorithm gener...
متن کاملPoint-Based Value Iteration Algorithms for Multi-Core Machines
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods which quickly provide approximate solutions for medium-sized problems. New multi-core machines offer an opportunity to scale up to much larger domains. These machines support parallel execution and can speed up existing algorithms considerably. In this paper we suggest several ways in which p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2018
ISSN: 1471-2105
DOI: 10.1186/s12859-018-2008-6